On the Number of $F$-Matchings in a Tree
نویسندگان
چکیده
منابع مشابه
On the Number of F-Matchings in a Tree
We prove that for any integers k,m > 0 and any tree F with at least one edge, there exists a tree whose number of F -matchings is congruent to k modulo m as well as an analogous result for induced F -matchings. This answers a question of Alon, Haber and Krivelevich (The number of F -matchings in almost every tree is a zero residue, Electron. J. Combin. 18 (2011), #P30).
متن کاملOn the Number of r-Matchings in a Tree
An r-matching in a graph G is a collection of edges in G such that the distance between any two edges is at least r. This generalizes both matchings and induced matchings as matchings are 1-matchings and induced matchings are 2-matchings. In this paper, we estimate the minimum and maximum number of r-matchings in a tree with fixed order.
متن کاملOn the number of matchings of a tree
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to obtain exact formulas for some of the countings by means of the Lagrange inversion formula. In this note, the results of Klazar are extended to formulas for matchings, maximal matchings and maximum matchings for three...
متن کاملThe Number of f-Matchings in Almost Every Tree is a Zero Residue
For graphs F and G an F -matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F . The number of F -matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F , the probability that s(F,Tn) ≡ 0 (mod m), where Tn is a random labeled tree with n vertices, tends to one exponentially fast as n grows to infinity. A similar ...
متن کاملThe number of maximal matchings in polyphenylene chains
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2052